A simple bijection for the regions of the Shi arrangement of hyperplanes

نویسندگان

  • Christos A. Athanasiadis
  • Svante Linusson
چکیده

The Shi arrangement Sn is the arrangement of affine hyperplanes in R n of the form xi−xj = 0 or 1, for 1 ≤ i < j ≤ n. It dissects R n into (n+1) regions, as was first proved by Shi. We give a simple bijective proof of this result. Our bijection generalizes easily to any subarrangement of Sn containing the hyperplanes xi − xj = 0 and to the extended Shi arrangements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orientations, Semiorders, Arrangements, and Parking Functions

It is known that the Pak-Stanley labeling of the Shi hyperplane arrangement provides a bijection between the regions of the arrangement and parking functions. For any graph G, we define the G-semiorder arrangement and show that the Pak-Stanley labeling of its regions produces all G-parking functions. In his study of Kazhdan-Lusztig cells of the affine Weyl group of typeAn−1, [10], J.-Y. Shi int...

متن کامل

Deformations of the Braid Arrangement and Trees Dedicated to Ira Gessel for His Retirement

We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form xi − xj = s for some integer s. Classical examples include the braid, Catalan, Shi, semiorder and Linial arrangements, as well as graphical arrangements. We express the number of regions of any such arrangement...

متن کامل

A Class of Labeled Posets and the Shi Arrangement of Hyperplanes

We consider the class Pn of labeled posets on n elements which avoid certain three-element induced subposets. We show that the number of posets in Pn is (n+1) by exploiting a bijection between Pn and the set of regions of the arrangement of hyperplanes in R of the form xi&xj=0 or 1 for 1 i< j n. It also follows that the number of posets in Pn with i pairs (a, b) such that a<b is equal to the nu...

متن کامل

Labeling the Regions of the Type Cn Shi Arrangement

The number of regions of the type Cn Shi arrangement in Rn is (2n + 1)n. Strikingly, no bijective proof of this fact has been given thus far. The aim of this paper is to provide such a bijection and use it to prove more refined results. We construct a bijection between the regions of the type Cn Shi arrangement in Rn and sequences a1a2 . . . an, where ai ∈ {−n,−n+1, . . . ,−1, 0, 1, . . . , n−1...

متن کامل

A bijection between dominant Shi regions and core partitions

It is well-known that Catalan numbers Cn = 1 n+1 ( 2n n ) count the number of dominant regions in the Shi arrangement of type A, and that they also count partitions which are both n-cores as well as (n + 1)-cores. These concepts have natural extensions, which we call here the m-Catalan numbers and m-Shi arrangement. In this paper, we construct a bijection between dominant regions of the m-Shi a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 204  شماره 

صفحات  -

تاریخ انتشار 1999